An improved cost estimation for unit commitment using back propagation algorithm
نویسندگان
چکیده
منابع مشابه
Channel Estimation of Power Line Communication using Back Propagation Algorithm
In the last few years a lot of research has been carried out in the field of deliverance of information for improving its efficiency and reliability. However, the systematic analysis and verification of channel performance triggered wide interest of new researchers. The popular technique for transmission of signals over wireless channels was orthogonal frequency division multiplexing (OFDM). In...
متن کاملThermal Unit Commitment Solution Using an Improved Lagrangian Relaxation
An improved Lagrangian relaxation (LR) solution to the thermal unit commitment problem (UCP) is proposed in this paper. The algorithm is characterized by: (1) a new Matlab function to determine the optimal path of the dual problem, (2) new initialization procedure of Lagrangian multipliers, based on both unit and time interval classification, (3) a flexible adjustment of Lagrangian multipliers,...
متن کاملSolving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm
One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA). Simula...
متن کاملAn Improved Constraint-Propagation Algorithm for Diagnosis
Diagnosing a system requires the identification of a set of components whose abnormal behavior could explain the faulty sys tem behavior. Previously, model-based diagnosis schemes have pro ceeded through a cycle of assumptions -* predictions observations assumptions-adjustment, where the basic assumptions entail the proper functioning of those components whose failure is not esta blished. He...
متن کاملAn Improved MIP Formulation for the Unit Commitment Problem
In this paper, we present an MIP formulation for the Unit Commitment problem that leads to significant computational time savings and almost-integral solutions when compared to the state-of-the-art formulations in the literature. Using a variety of test instances from the literature, we provide empirical evidence that the polyhedral structure of the new formulation is tighter than the polyhedra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaysian Journal of Fundamental and Applied Sciences
سال: 2019
ISSN: 2289-599X,2289-5981
DOI: 10.11113/mjfas.v15n2.1146